Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Failure profiles of coherent systems

In this paper we first introduce and study the notion of failure profiles which is based on the concepts of paths and cuts in system reliability. The relationship of failure profiles to two notions of component importance is highlighted, and an expression for the density function of the lifetime of a coherent system, with independent and not necessarily identical component lifetimes, is derived. We then demonstrate the way that failure profiles can be used to establish likelihood ratio orderings of lifetimes of two systems. Finally we use failure profiles to obtain bounds, in the likelihood ratio sense, on the lifetimes of coherent systems with independent and not necessarily identical component lifetimes. The bounds are relatively easy to compute and use. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

求解传感器网络最大生存时间的最大流算法

节能是传感器网络研究的中心问题之一,目的是延长网络的生存时间。因此对于一个给定网络,很自然地关心它的最大生存时间是多少。从网络最大流的角度分析这个问题,给出了求解传感器网络最大生存时间确切值的算法。     

基于状态的装备可靠度模型及其应用

为应用基于状态的装备可靠度模型，实现对装备的精确维修，采用了比例风险模型（Proportional Hazards Model，PHM）将装备的年龄信息及检测所得状态信息融入系统的风险函数中。考虑到样本包含截尾数据的情形，应用极大似然估计方法对模型中的参数进行了估计以及相应的模型检验。通过对该方法在一个实际案例中应用的详细分析，验证了方法的可行性。     

基于星座图恢复的MQAM信号调制方式识别算法*

针对MQAM信号调制方式的识别问题,提出了一种基于星座图恢复的算法。该算法首先估计信号载频及信噪比等参数,并依据波特率和符号定时完成对接收信号的波特率采样。随后采用一种非判决辅助载频偏差估计方法,以消除载频偏差及相位偏移对星座图恢复的影响。最后利用平均似然比检测的方法,完成MQAM信号调制方式的识别。仿真结果表明,与仅考虑信号幅值分布的极大似然算法相比,该算法具有更优的识别性能。     

幅相调制信号的星座图恢复与调制方式识别

针对幅相调制信号的调制方式识别问题,提出一种基于星座图恢复的算法。该算法估计信号载频及信噪比等参数,并依据波特率和符号定时完成对接收信号的波特率采样;采用一种非数据辅助载频偏差估计方法,以消除载频偏差及相位偏移对星座图恢复的影响;利用平均似然比检测的方法,完成幅相调制信号调制方式的识别。仿真结果表明,与仅考虑信号幅值分布的极大似然算法相比,该算法具有识别性能更优。     

基于MATLAB/GUI的MIMO通信仿真软件设计与实现

为满足采用不同调制方式和空时编码类型的MIMO(Multiple Input Multiple Output)通信的性能分析需求,在深入研究MIMO通信机理和空时编译码机理基础上,基于MATLAB/GUI软件环境进行MIMO通信仿真软件设计,实现了对不同参数条件下MIMO通信系统性能分析的可视化、可交互性。仿真结果表明DBLAST(Diagonal Bell-Labs Layered Space-Time)在4FSK(Frequency Shift Keying)和QPSK(Quadrature Phase Shift Keying)调制方式下性能较优,利用设计的仿真软件可对MIMO通信的参数优化配置提供指导。     

失效概率函数求解的高效算法

结合基于分数矩约束的极大熵方法和替代模型法,发展了一种失效概率函数求解的高效算法。所提算法的基本思路是利用自主学习的迭代Kriging方法来构造失效概率函数,即采用较少的训练样本来构造粗糙的失效概率函数,在此基础上通过添加新的违反学习函数约束的样本来更新失效概率函数,直到达到精度要求。对于每一个分布参数的训练样本点,所提方法采用分数矩约束的极大熵法来求解相应的失效概率样本。由于分数矩的计算采用了高效的降维积分,并且由于分数矩约束下极大熵法中优化策略高效地逼近了响应的概率密度函数,从而使得失效概率样本能够被高效高精度地估计出来。为了检验所提方法的精度及效率,给出了两个算例,对比了所提方法与已有的失效概率函数求解的Bayes公式法及Monte Carlo法等,结果表明,所提方法适用于求解复杂的功能函数问题,且在满足精度要求的基础上大大降低了计算量。     

基因短序列模式分析及其在5'剪接位点识别中的应用

短序列模式分析是基因序列分析的一个重要组成部分,在进行生物信号识别的时候,一般都会利用到短序列模式的信息。通常短序列模式的数目很多,如果每个都应用到生物信号识别中,会产生大量的参数,而且无法体现信号的主要特征。为了找出在识别信号位点中起关键作用的短序列模式,以信息增益作为评价依据,按照逐步选择的策略,将模式进行排队。根据排队结果,选取信息增益突出的短序列模式作为识别生物信号的关键依据,这样可以用较少的模式得到较好的结果。结合选取的短序列模式,用最大熵模型作为信号序列真实分布的估计,从而对给定序列进行识别。最后将这个方法用于5’剪接位点的识别,得到了满意的结果。